Path algebra algorithm for finding longest increasing subsequence

摘要

New algorithm for finding longest increasing subsequence is discussed. Thisalgorithm is based on the ideas of idempotent mathematics and uses Max-Plusidempotent semiring. Problem of finding longest increasing sub- sequence isreformulated in a matrix form and solved with linear algebra.